7

MAX-CUT has a randomized approximation scheme in dense graphs

Year:
1996
Language:
english
File:
PDF, 508 KB
english, 1996
9

Bin packing can be solved within 1 + ε in linear time

Year:
1981
Language:
english
File:
PDF, 388 KB
english, 1981
19

The largest induced tree in a sparse random graph

Year:
1996
Language:
english
File:
PDF, 192 KB
english, 1996
21

Polynomial time approximation of dense weighted instances of MAX-CUT

Year:
2000
Language:
english
File:
PDF, 162 KB
english, 2000
28

A Randomized Approximation Scheme for Metric MAX-CUT

Year:
2001
Language:
english
File:
PDF, 113 KB
english, 2001
29

On the maximum density of graphs which have no subcontraction to K3

Year:
1983
Language:
english
File:
PDF, 57 KB
english, 1983
30

Kernels in random graphs

Year:
1990
Language:
english
File:
PDF, 214 KB
english, 1990
32

Trees in sparse random graphs

Year:
1988
Language:
english
File:
PDF, 471 KB
english, 1988
33

The forwarding index of communication networks with given connectivity

Year:
1992
Language:
english
File:
PDF, 936 KB
english, 1992
35

On the approximation hardness of dense TSP and other path problems

Year:
1999
Language:
english
File:
PDF, 51 KB
english, 1999
36

Random sampling and approximation of MAX-CSPs

Year:
2003
Language:
english
File:
PDF, 330 KB
english, 2003
37

The task allocation problem with constant communication

Year:
2003
Language:
english
File:
PDF, 132 KB
english, 2003
39

The forwarding diameter of graphs

Year:
1998
Language:
english
File:
PDF, 641 KB
english, 1998
40

Random 2-SAT: results and problems

Year:
2001
Language:
english
File:
PDF, 142 KB
english, 2001
47

The Forwarding Indices of Random Graphs

Year:
1992
Language:
english
File:
PDF, 433 KB
english, 1992
48

Grids in random graphs

Year:
1994
Language:
english
File:
PDF, 356 KB
english, 1994